Zeta Function and Cryptographic Exponent of Supersingular Curves of Genus 2
نویسندگان
چکیده
We compute in a direct (not algorithmic) way the zeta function of all supersingular curves of genus 2 over a finite field k, with many geometric automorphisms. We display these computations in an appendix where we select a family of representatives of all these curves up to k-isomorphism and we exhibit equations and the zeta function of all their k/k-twists. As an application we obtain a direct computation of the cryptographic exponent of the Jacobians of these curves.
منابع مشابه
A ug 2 00 4 Zeta functions of supersingular curves of genus 2
This paper was motivated by the problem of determining what isogeny classes of abelian surfaces over a finite field k contain jacobians. In [MN] we performed a numerical exploration of this problem, that led to several conjectures. We present in this paper a complete answer for supersingular surfaces in characteristic 2 (section 5). We deal with this problem in a direct way by computing explici...
متن کاملSpeeding Up Pairing Computations on Genus 2 Hyperelliptic Curves with Efficiently Computable Automorphisms
Pairings on the Jacobians of (hyper-)elliptic curves have received considerable attention not only as a tool to attack curve based cryptosystems but also as a building block for constructing cryptographic schemes with new and novel properties. Motivated by the work of Scott, we investigate how to use efficiently computable automorphisms to speed up pairing computations on two families of non-su...
متن کاملOn the Existence of Supersingular Curves Of Given Genus
In this note we shall show that there exist supersingular curves for every positive genus in characteristic 2. Recall that an irreducible smooth algebraic curve C over an algebraically closed field F of characteristic p > 0 is called supersingular if its jacobian is isogenous to a product of supersingular elliptic curves. An elliptic curve is called supersingular if it does not have points of o...
متن کاملOn the Efficiency and Security of Pairing-Based Protocols in the Type 1 and Type 4 Settings
We focus on the implementation and security aspects of cryptographic protocols that use Type 1 and Type 4 pairings. On the implementation front, we report improved timings for Type 1 pairings derived from supersingular elliptic curves in characteristic 2 and 3 and the first timings for supersingular genus-2 curves in characteristic 2 at the 128-bit security level. In the case of Type 4 pairings...
متن کاملOn the Efficiency and Security of Pairing-Based Protocols in the Type
We focus on the implementation and security aspects of cryptographic protocols that use Type 1 and Type 4 pairings. On the implementation front, we report improved timings for Type 1 pairings derived from supersingular elliptic curves in characteristic 2 and 3 and the first timings for supersingular genus-2 curves in characteristic 2 at the 128-bit security level. In the case of Type 4 pairings...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007